package com.zyk.leetcode;

/**
 * @author zhangsan
 * @date 2021/5/10 8:58
 */
public class C873 {

    /*public static int lenLongestFibSubseq(int[] arr) {
        int N = arr.length, max = Integer.MIN_VALUE;
        for(int i = 0; i < N; ++i) {
            max = Math.max(max, process(arr, i + 1, i, arr[i]));
        }
        return max;
    }

    public static int process(int[] arr, int i, int preIndex, int preSum) {

    }*/

}
